Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time
نویسندگان
چکیده
Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n log n/ log log n) time with O(n) space. This improves on a recent O(n log n) time bound by Klein et al.
منابع مشابه
Efficient Computation of Euclidean Shortest Paths in the Plane
We propose a new algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worst-case time O(nlog2n) and requires O(n1ogn) space, where n is the total number of vertices in the obstacle polygons. Our algorithm actually computes a planar map that encodes shortest paths from a fixed...
متن کاملShortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log n)-Time Algorithm
We give an O(n log n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log n) time and O(n logn) space.
متن کاملMin-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
We present a deterministic O(n log log n) time algorithm for finding shortest cycles and minimum cuts in planar graphs. The algorithm improves the previously known fastest algorithm by Italiano et al. in STOC’11 by a factor of log n. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach.
متن کاملSolving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time
In a graph G with non-negative edge lengths, let P be a shortest path from a vertex s to a vertex t. We consider the problem of computing, for each edge e on P , the length of a shortest path in G from s to t that avoids e. This is known as the replacement paths problem. We give a linearspace algorithm with O(n log n) running time for n-vertex planar directed graphs. The previous best time boun...
متن کاملFaster shortest paths in dense distance graphs, with applications
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC’94]. The second is Fakcharoenphol and Rao’s algorithm [FOCS’01] for emulating Dijkstra’s algorithm on the dense distance graph (DDG). A DDG is defined for a decomposition of a planar graph G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010